Towards Computational Processing of Sanskrit
نویسنده
چکیده
We present in this paper recent progress in Sanskrit computational linguistics. We propose a solution to the tagging of verb phrases which correctly handles the non-associativity of external sandhi arising from the treatment of preverb ā. This involves a notion of phantom phoneme. We give exemples of execution of a computer tagger designed accordingly, which handles verb phrases as well as noun phrases.
منابع مشابه
A New Computational Schema for Euphonic Conjunctions in Sanskrit Processing
Automated language processing is central to the drive to enable facilitated referencing of increasingly available Sanskrit E-texts. The first step towards processing Sanskrit text involves the handling of Sanskrit compound words that are an integral part of Sanskrit texts. This firstly necessitates the processing of euphonic conjunctions or sandhi-s, which are points in words or between words, ...
متن کاملSanskrit as a Programming Language and Natural Language Processing
In this paper represents the work toward developing a dependency parser for Sanskrit language and also represents the efforts in developing a NLU(Natural Language Understanding) and NLP(Natural Language Processing) systems. Here, we use ashtadhayayi (a book of Sanskrit grammar) to implement this idea. We use this concept because the Sanskrit is an unambiguous language. In this paper, we are pre...
متن کاملAnalysis of Sanskrit Text: Parsing and Semantic Relations
In this paper, we are presenting our work towards building a dependency parser for Sanskrit language that uses deterministic finite automata(DFA) for morphological analysis and ’utsarga apavaada’ approach for relation analysis. A computational grammar based on the framework of Panini is being developed. A linguistic generalization for Verbal and Nominal database has been made and declensions ar...
متن کاملA Study towards Design of an English to Sanskrit Machine Translation System
We are experimenting to examine how AnglaBharati system designed to translate English to Indian languages could be adapted for translation to Sanskrit. The main contribution of our work is demonstration of machine translation of English to Sanskrit for simple sentences based on PLIL generated by AnglaBharati and Ashtadhyayi rules. Presently our translation system caters to affirmative, negative...
متن کاملFormal Structure of Sanskrit Text: Requirements Analysis for a Mechanical Sanskrit Processor
We discuss the mathematical structure of various levels of representation of Sanskrit text in order to guide the design of computer aids aiming at useful processing of the digitalised Sanskrit corpus. Two main levels are identified, respectively called the linear and functional level. The design space of these two levels is sketched, and the computational implications of the main design choices...
متن کامل